Interprocedural analyses of Fortran programs
نویسندگان
چکیده
منابع مشابه
Interprocedural Compilation of Fortran D (extended Version) Interprocedural Compilation of Fortran D
Fortran D is a version of Fortran extended with data decomposition speciications. It is designed to provide a machine-independent programming model for data-parallel applications and has heavily innuenced the design of High Performance Fortran (HPF). In previous work we described Fortran D compilation algorithms for individual procedures. This paper presents an interprocedural approach to analy...
متن کاملInterprocedural Analyses: A Comparison
We present a framework for program analysis of languages with procedures which is general enough to allow for a comparison of various approaches to interproce-dural analysis. Our framework is based on a small-step operational semantics and subsumes both frameworks for imperative and for logic languages. We consider reachability analysis, that is, the problem of approximating the sets of program...
متن کاملParallel Fortran Programs
Data parallel programming stands for single threaded, global name space, and loosely synchronous parallel computation. This kind of parallel programming has been proven to be very user-friendly, easy to debug and easy to use. But this programming model is not available for most message passing multiprocessor architectures. Adaptor (Automatic Data Parallelism Translator) is a compilation system ...
متن کاملRestructuring Fortran Programs for Cedar
This paper reports on the status of the Fortran translator for the Cedar computer at the end of March, 1991. A brief description of the Cedar Fortran language is followed by a discussion of the fortran77 to Cedar Fortran parallelizer that describes the techniques currently being implemented. A collection of experiments illustrate the e ectiveness of the current implementation, and point toward ...
متن کاملInterprocedural Reachability for Flat Integer Programs
We study context-free grammars whose generated language is bounded (that is, subset of some expression w ̊ 1 . . . w ̊ d called bounded expression). We investigate the underlying generating process of such language and show that there exists a bounded expression u1 . . . um over the production rules, such that the language is generated only by sequences of production rules conforming to the bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 1998
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(98)00028-3